21![Interval Scheduling to Maximize Bandwidth Provision Mordechai Shalom 1 ∗ Interval Scheduling to Maximize Bandwidth Provision Mordechai Shalom 1 ∗](https://www.pdfsearch.io/img/c45370e6eb3acc19edb5b48fae037934.jpg) | Add to Reading ListSource URL: cgi.csc.liv.ac.ukLanguage: English - Date: 2013-09-22 04:19:43
|
---|
22![Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel † Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †](https://www.pdfsearch.io/img/43958b3310f839a201433e5b8eedfecc.jpg) | Add to Reading ListSource URL: www.cs.huji.ac.ilLanguage: English - Date: 2014-11-26 08:32:33
|
---|
23![Spectral Graph Theory Lecture 3 The Adjacency Matrix and The nth Eigenvalue Daniel A. Spielman Spectral Graph Theory Lecture 3 The Adjacency Matrix and The nth Eigenvalue Daniel A. Spielman](https://www.pdfsearch.io/img/49c5a7b9f02b3122cf281702310c7a57.jpg) | Add to Reading ListSource URL: www.cs.yale.eduLanguage: English - Date: 2015-08-17 14:43:26
|
---|
24![Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory](https://www.pdfsearch.io/img/3b9299088f98623e19cbb913a7d3262b.jpg) | Add to Reading ListSource URL: disco.ethz.chLanguage: English - Date: 2014-09-26 08:36:28
|
---|
25![Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office](https://www.pdfsearch.io/img/64d129594eb09fcf1275eca899748649.jpg) | Add to Reading ListSource URL: pagesperso.lina.univ-nantes.frLanguage: English - Date: 2011-04-27 05:26:37
|
---|
26![BR-Index: An Indexing Structure for Subgraph Matching in Large Dynamic Graphs Jiong Yang and Wei Jin EECS Department Case Western Reserve University BR-Index: An Indexing Structure for Subgraph Matching in Large Dynamic Graphs Jiong Yang and Wei Jin EECS Department Case Western Reserve University](https://www.pdfsearch.io/img/4c47ea1992fc5e31f512bf936a3cefb4.jpg) | Add to Reading ListSource URL: ssdbm2011.ssdbm.orgLanguage: English - Date: 2011-09-01 19:29:56
|
---|
27![Graph-coloring ideals Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases David Rolnick Graph-coloring ideals Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases David Rolnick](https://www.pdfsearch.io/img/8fe07dc5d117338a03d5c26515716a43.jpg) | Add to Reading ListSource URL: www.issac-symposium.orgLanguage: English - Date: 2015-08-17 07:00:17
|
---|
28![CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS STRUCTURE AND COMPLEXITY CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS STRUCTURE AND COMPLEXITY](https://www.pdfsearch.io/img/551c23973fc5eff30fccb05ff1f8e90f.jpg) | Add to Reading ListSource URL: kam.mff.cuni.czLanguage: English - Date: 2007-10-31 07:12:22
|
---|
29![Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France](https://www.pdfsearch.io/img/75756f6732e10a5c0fe56c33875a91fe.jpg) | Add to Reading ListSource URL: pagesperso.lina.univ-nantes.frLanguage: English - Date: 2011-04-27 05:27:10
|
---|
30![Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p](https://www.pdfsearch.io/img/8f07d34069380c090df599bb67bdc5bc.jpg) | Add to Reading ListSource URL: disco.ethz.chLanguage: English - Date: 2014-09-26 08:36:22
|
---|